COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	CS 258 Course Description
C00003 ENDMK
C⊗;
CS 258 Course Description

258.  Mathematical Theory of Computation--Abstract syntax and formal
semantics of programming languages.  Recursively defined and algolic programs.
Proving assertions about computer programs using formalisms of Boyer and
Moore, Burstall, Cartwright, Floyd, Manna, McCarthy, and Scott.  The
emphasis is on functional programs rather than sequential.  Use of proof-
checking programs including EKL and the Boyer-Moore theorem prover.
Prerequisite: 156.  Recommended: 206.